|
In formal language theory, a non-empty set is called alphabet when its intended use in string operations shall be indicated. Its members are then commonly called ''symbols'' or ''letters'', e.g. characters or digits.〔〔 For example, a common alphabet is , the binary alphabet. A finite string is a finite sequence of letters from an alphabet; for instance a binary string is a string drawn from the alphabet . An infinite sequence of letters may be constructed from elements of an alphabet as well. Given an alphabet , we write * to denote the set of all finite strings over the alphabet . Here, the ==See also== *Combinatorics on words 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Alphabet (formal languages)」の詳細全文を読む スポンサード リンク
|